Clustering Ensemble Framework via Ant Colony

نویسندگان

  • Hamid Parvin
  • Akram Beigi
چکیده

Ensemble-based learning is a very promising option to reach a robust partition. Due to covering the faults of each other, the classifiers existing in the ensemble can do the classification task jointly more reliable than each of them. Generating a set of primary partitions that are different from each other, and then aggregation the partitions via a consensus function to generate the final partition, is the common policy of ensembles. Another alternative in the ensemble learning is to turn to fusion of different data from originally different sources. Swarm intelligence is also a new topic where the simple agents work in such a way that a complex behavior can be emerged. Ant colony algorithm is a powerful example of swarm intelligence. In this paper we introduce a new ensemble learning based on the ant colony clustering algorithm. Experimental results on some real-world datasets are presented to demonstrate the effectiveness of the proposed method in generating the final partition.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Clustering Ensemble Learning Method Based on the Ant Colony Clustering Algorithm

A very promising approach to reach a robust partitioning is to use ensemble-based learning. In this way, the classification/clustering task is more reliable, because the classifiers/clusterers in the ensemble cover the faults of each other. The common policy in clustering ensemble based learning is to generate a set of primary partitionings that are different from each other. These primary part...

متن کامل

A hybrid ensemble approach for the Steiner tree problem in large graphs: A geographical application

Hybrid approaches are often recommended for dealing in an efficient manner with complex problems that require considerable computational time. In this study, we follow a similar approach consisting of combining spectral clustering and ant colony optimization in a two-stage algorithm for the purpose of efficiently solving the Steiner tree problem in large graphs. The idea of the two-stage approa...

متن کامل

Improved Ant Colony Optimization towards Robust Ensemble Co-Clustering Algorithm (IACO-RECCA) for Enzyme Clustering

This research work intends to propose a system with Improved Ant Colony Optimization (IACO) based on enhanced preprocessing method for enzyme clustering. A powerful optimization system is proposed in this research work initially deals with the enhanced principal component analysis. At that point the target function for the co-clustering troupe towards application to enzyme clustering is present...

متن کامل

Ant Colony Optimization with a New Random Walk Model for Community Detection in Complex Networks

Detecting communities from complex networks has recently triggered great interest. Aiming at this problem, a new ant colony optimization strategy building on the Markov random walks theory, which is named as MACO, is proposed in this paper. The framework of ant colony optimization is taken as the basic framework in this algorithm. In each iteration, a Markov random walk model is employed as heu...

متن کامل

An Ant-Colony Optimization Clustering Model for Cellular Automata Routing in Wireless Sensor Networks

High efficient routing is an important issue for the design of wireless sensor network (WSN) protocols to meet the severe hardware and resource constraints. This paper presents an inclusive evolutionary reinforcement method. The proposed approach is a combination of Cellular Automata (CA) and Ant Colony Optimization (ACO) techniques in order to create collision-free trajectories for every agent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011